Construction of Irregular LDPC Codes with Low Error Floors
نویسندگان
چکیده
This work describes a new systematic construction approach for irregular low-density parity-check codes based on the splitting-and-filling technique. The generated code using this proposed method not only has a given degree distribution pair but also has girth of at least six. More importantly, by carefully filling the elements of the variable (check) node sets during the generating process, we can optimize one of the special combinatorial characteristics, such as the stopping size or the girth, of an LDPC code. Simulation results show that the resulting code can achieve good near capacity performance as well as good error-floor performance when decoded using the iterative belief propagation (BP) decoding method.
منابع مشابه
Parity-Check Matrix Extension to Lower the Error Floors of Irregular LDPC Codes
Trapping sets have been identified as one of the main factors causing error floors of low-density parity-check (LDPC) codes at high SNR values. By adding several new rows to the original parity-check matrix, a novel method is proposed to eliminate small trapping sets in the LDPC code’s Tanner graph. Based on this parity-check matrix extension, we design new codes with low error floors from the ...
متن کاملConstruction of Irregular LDPC Code Using ACE Algorithm
The Low Density Parity Check (LDPC) codes have been widely acclaimed in recent years for their nearcapacity performance, they have not found their way into many important applications. For some cases, this is due to their increased decoding complexity relative to the classical coding techniques. For other cases, this is due to their inability to reach very low bit error rates at low signal-to-n...
متن کاملConstruction of irregular LDPC codes with low error floors
This work explains the relationship between cycles, stopping sets, and dependent columns of the parity check matrix of low-density parity-check (LDPC) codes. Furthermore, it discusses how these structures limit LDPC code performance under belief propagation decoding. A new metric called extrinsic message degree (EMD) measures cycle connectivity in bipartite graphs. Using an easily computed esti...
متن کاملOn Constructing Low-Density Parity-Check Codes
This thesis focuses on designing Low-Density Parity-Check (LDPC) codes for forward-error-correction. The target application is real-time multimedia communications over packet networks. We investigate two code design issues, which are important in the target application scenarios, designing LDPC codes with low decoding latency, and constructing capacity-approaching LDPC codes with very low error...
متن کاملAn Efficient Heuristic Approach for Irregular LDPC Code Construction with Low Error
Low-Density Parity-Check (LDPC) codes are increasingly being considered as good candidates for the nextgeneration FEC codes in high throughput wireless and recording applications. Trapping sets (TSs) are known to cause error floors in regular and irregular low-density parity-check (LDPC) codes. In existing algorithm, namely the Progressive-Edge-Growth Approximate-minimum-Cycle-Set-Extrinsic-mes...
متن کامل